Two Polynomial Time Solvable Multicommodity Flow Problems
نویسندگان
چکیده
The multicommodity flow problem is NP-hard already for two commodities over bipartite graphs. Nonetheless, using our recent theory of n-fold integer programming and extensions developed herein, we are able to establish the surprising polynomial time solvability of the problem in two broad situations.
منابع مشابه
Multicommodity Flow
Leighton and Rao use multicommodity flow results to design the first polynomial time approximation algorithms for well known NP-Hard optimization problems. Such problems include graph partitioning, crossing number, VLSI layout, and many more. Furthermore, Leighton and Rao are responsible for establishing the max-flow min-cut theorems on multicommodity flow problems, which lead to the algorithms...
متن کاملInteger Multicommodity Flows with Reduced Demands Integer Multicommodity Flows with Reduced Demands
Given a supply graph G = (V; E), a demand graph H = (T; D), edge capacities c : E 7 ! II N and requests r : D 7 ! II N, we consider the problem of nding integer multiiows subject to c; r. Korach and Penn constructed approximate integer multiiows for planar graphs, but no results were known for the general case. Via derandomization we present a polynomial-time approximation algorithm. There are ...
متن کاملFast and simple approximation schemes for generalized flow
We present fast and simple fully polynomial-time approximation schemes (FPTAS) for generalized versions of maximum flow, multicommodity flow, minimum cost maximum flow, and minimum cost multicommodity flow. We extend and refine fractional packing frameworks introduced in FPTAS’s for traditional multicommodity flow and packing linear programs. Our FPTAS’s dominate the previous best known complex...
متن کاملFast Approximation Algorithms for Fractional Steiner Forest and Related Problems
We give a fully polynomial time approximation scheme (FPTAS) for the optimum fractional solution to the Steiner forest problem. This can easily be generalized to obtain an FPTAS for a hitting set problem on a collection of clutters. We also identify three other problems on collections of clutters and show how these four problems are related when the clutters have the max-flow min-cut (MFMC) pro...
متن کاملIncremental flow
This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that build on each other incrementally. Thus far, incremental problems considered in the literature have been built on NP-complete problems. To the best of our knowledge, our results are the first to find a polynomial time prob...
متن کامل